Quantum State Transfer on Neighborhood Corona of Two Graphs

Given two graphs $$G_{1}$$ of order $$n_{1}$$ and $$G_{2}$$ , the neighborhood corona denoted by $$G_{1}\bigstar G_{2}$$ is graph obtained taking one copy copies in meanwhile, linking all neighbors i-th vertex with vertices . In our work, we give some conditions that not periodic. Furthermore, demonstrate sufficient for having no perfect state transfer. Some examples are provided to explain results. addition, reason admitting transfer rare, also consider pretty good on graphs. We show